Productive classes and subdirect irreducibility, in particular for graphs
نویسندگان
چکیده
منابع مشابه
Generating particular classes of connected graphs
We present an algorithm to generate all connected graphs in a recursive and efficient manner. This algorithm is restricted subsequently to 1-particle irreducible graphs and to connected graphs without selfloops. The recursions proceed by loop order and vertex number. The main result of [1] is a recursion formula to generate all tree graphs. The underlying structure is a Hopf algebraic represent...
متن کاملClique irreducibility of some iterative classes of graphs
In this paper, two notions, the clique irreducibility and clique vertex irreducibility are discussed. A graph G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and it is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G. It is proved that L(G) is clique irreducible if a...
متن کاملClique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کامل1 Communication classes and irreducibility for Markov chains
For a Markov chain with state space S, consider a pair of states (i, j). We say that j is reachable from i, denoted by i → j, if there exists an integer n ≥ 0 such that Pn ij > 0. This means that starting in state i, there is a positive probability (but not necessarily equal to 1) that the chain will be in state j at time n (that is, n steps later); P (Xn = j|X0 = i) > 0. If j is reachable from...
متن کاملSubdirect Decomposition of n-Chromatic Graphs
It is shown that any n-chromatic graph is a full subdirect product of copies of the complete graphs Kn and Kn+1, except for some easily described graphs which are full subdirect products of copies of Kn+1 − {◦–◦} and Kn+2 − {◦–◦}; full means here that the projections of the decomposition are epimorphic in edges. This improves some results of Sabidussi. Subdirect powers of Kn or Kn+1 − {◦–◦} are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90055-3